Hierarchical Microbial Functions Prediction by Graph Aggregated Embedding

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gene Function Prediction via Discriminative Graph Embedding

Gene function has been a subject of interest but it is far from fully understood. It is known that some genes have certain functions but it is not clear whether those are all the functions they have. It is a recent trend to use different means to predict gene functions; one of them is to use computational methods on large data sets. Different types of information are used in computational metho...

متن کامل

Graph Embedding aided Relationship Prediction in Heterogeneous Networks

We consider the problem of predicting relationships in largescale heterogeneous networks. For example, one can try to predict if a researcher will publish at a conference (eg: VLDB) given her previous publications, or try to anticipate if two reputed researchers working in the same area will collaborate. The main challenge is to extract latent information from such real-world networks which are...

متن کامل

Semi-supervised Graph Embedding Approach to Dynamic Link Prediction

We propose a simple discrete time semi–supervised graph embedding approach to link prediction in dynamic networks. The learned embedding reflects information from both the temporal and cross–sectional network structures, which is performed by defining the loss function as a weighted sum of the supervised loss from past dynamics and the unsupervised loss of predicting the neighborhood context in...

متن کامل

Graph Embedding

Some of the parameters used to analyze the efficiency of an embedding are dilation, expansion, edge congestion and wirelength. If e = (u, v) ∈E (G), then the length of Pf (e) in H is called the dilation of the edge e. The maximal dilation over all edges of G is called the dilation of the embedding f. The dilation of embedding G into H is the minimum dilation taken over all embeddings f of G int...

متن کامل

Knowledge Graph Embedding by Translating on Hyperplanes

We deal with embedding a large scale knowledge graph composed of entities and relations into a continuous vector space. TransE is a promising method proposed recently, which is very efficient while achieving state-of-the-art predictive performance. We discuss some mapping properties of relations which should be considered in embedding, such as reflexive, one-to-many, many-to-one, and many-to-ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Frontiers in Genetics

سال: 2021

ISSN: 1664-8021

DOI: 10.3389/fgene.2020.608512